Measuring Time-Frequency Information and Complexity Using the Renyi Entropies - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
نویسندگان
چکیده
In search of a n o n p a r a m e t r i c i nd ica to r of d e t e r m i n i s t i c s igna l complexi ty , we link the Rkny i e n t r o p i e s to t imef r equency r ep resen ta t ions . The resu l t i ng measures show promise in seve ra l s i t ua t ions where concepts like the t i m e b a n d w i d t h product fail.
منابع مشابه
The Trellis Complexity of Convolutional Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
متن کامل
Unit-Memory Hamming Turbo Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
متن کامل
Multilevel Diversity Coding with Symmetrical Connectivity - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
متن کامل
On the Twisted Squaring Construction, Symmetric-Reversible Designs and Trellis Diagrams of Block Cod - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
(32,26:1 (32.10) 28 21 19
متن کاملMeasuring time-Frequency information content using the Rényi entropies
The generalized entropies of Rényi inspire new measures for estimating signal information and complexity in the time–frequency plane. When applied to a time–frequency representation (TFR) from Cohen’s class or the affine class, the Rényi entropies conform closely to the notion of complexity that we use when visually inspecting time–frequency images. These measures possess several additional int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004